Planet Prob Based Learn

نویسندگان

  • Steve Gaskin
  • Brian Chalkley
  • Mike Sanders
  • Helen King
چکیده

The use of case studies in the context of Problem-Based Learning (PBL) is described. A rationale for the use of a problem-based approach is given together with some key features that arise. Two case studies are described briefly in terms of their relevance to an interdisciplinary subject area (Environmental Sciences), their content, some operational aspects, and their applicability in the teaching of key skills. Some positive features of using this style of teaching are discussed with reference to student feedback and tutor observation. In addition, the impact of using a problem-based approach on, e.g. time and other resources, is also highlighted. These are considered to be particularly relevant within the contexts of students’ expectations of teaching and assessment, demands on tutors’ subject knowledge, and access to information sources.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of Planet Factors of Smart City through Multi-layer Fuzzy Logic (MFL)

Internet of Things (IoT) approach is empowering smart city creativities all over the world. There is no specific tool or criteria for the evaluation of the services offered by the smart city. In this paper, a new Multilayer Fuzzy Inference System (MFIS) is proposed for the assessment of the Planet Factors of smart city (PFSC). The PFSC system is categorized into two levels. The proposed MFIS ba...

متن کامل

Verification-based Learning: A Generalized Strategy for Inferring Problem-Reduction Methods

A ma jo r imped iment to the development of h igh-performance knowledge-based systems arises f rom the p roh ib i t i ve ef for t i n volved in equipping these systems w i t h a suff ic ient set of problem-solv ing methods. Thus , one impo r t an t research prob lem in Machine Learn ing has been the study of techniques for inferr ing problem-solv ing methods f r om examples. A l t hough a numbe...

متن کامل

Role-depth Bounded Least Common Subsumer in Prob-EL with Nominals

Completion-based algorithms can be employed for computing the least common subsumer of two concepts up to a given role-depth, in extensions of the lightweight DL EL. This approach has been applied also to the probabilistic DL Prob-EL, which is variant of EL with subjective probabilities. In this paper we extend the completion-based lcscomputation algorithm to nominals, yielding a procedure for ...

متن کامل

ProB: A Model Checker for B

We present ProB, an animation and model checking tool for the B method. ProB’s animation facilities allow users to gain confidence in their specifications, and unlike the animator provided by the B-Toolkit, the user does not have to guess the right values for the operation arguments or choice variables. ProB contains a model checker and a constraint-based checker, both of which can be used to d...

متن کامل

Lexical Acquisition in the Presence of Noise and Homonymy Je rey

This paper conjectures a computational account of how children might learn the meanings of words in their native language First a simpli ed version of the lexical acquisition task faced by children is mod eled by a precisely speci ed formal problem Then an implemented algorithm for solving this formal prob lem is presented Key advances of this algorithm over previously proposed algorithms are i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001